Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
641	Susan Margulies margulie at usna dot edu United States Naval Academy, Department of Mathematics, Annapolis, MDResearch Interests Optimization, Graph Theory, Computer Algebra, Algorithms and Complexity, Quantum Com Add to Reading List Source URL: www.usna.edu Language: English - Date: 2015-05-19 21:11:47 Mathematics Convex optimization Mathematical optimization Computational problems Combinatorial optimization Computational complexity theory Combinatorics Linear programming Discrete mathematics Operations research Theoretical computer science Applied mathematics
642	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Geometric Hitting Set and Set Cover Problems with Half-Strips Apurva Mudgal ∗, ‡ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-20 06:19:10 Mathematical logic Computational complexity theory Gadget Clause Variable Theoretical computer science Mathematics Logic programming
643	review-article2015 CPXXXX10.1177/2167702614562040Huys et al.Decision-Theoretic Psychiatry Add to Reading List Source URL: www.quentinhuys.com Language: English - Date: 2015-05-17 06:35:08 Science Control theory Decision theory Prior probability Computational complexity theory Economic model Utility Statistics Bayesian statistics Probability and statistics
644	Online Bipartite Perfect Matching With Augmentations Kamalika Chaudhuri∗ , Constantinos Daskalakis† , Robert D. Kleinberg‡ , and Henry Lin† ∗ Information Theory and Applications Center, U.C. San Diego Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2011-01-01 02:41:47 Analysis of algorithms Combinatorial optimization Matching Randomized algorithm Load balancing Server SL Big O notation Hopcroft–Karp algorithm Theoretical computer science Computational complexity theory Mathematics
645	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
646	Optimal-Time Adaptive Strong Renaming, with Applications to Counting [Extended Abstract] Dan Alistarh ∗ EPFL Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:10 Sorting algorithms Computational complexity theory Analysis of algorithms Algorithm Mathematical logic Randomized algorithm Time complexity Consensus Sorting network Theoretical computer science Applied mathematics Mathematics
647	C URRICULUM V ITAE David B. Shmoys 231 Rhodes Hall Cornell University Ithaca, NY9146 Add to Reading List Source URL: people.orie.cornell.edu Language: English - Date: 2015-03-17 17:48:30 Computational complexity theory ACM SIGACT Clifford Stein Approximation algorithm Mathematical optimization Algorithm Combinatorial optimization Computer science Edward G. Coffman Jr. Applied mathematics Theoretical computer science Mathematics
648	Why is P Not Equal to N P ? ? Michael Fellows1,2 and Frances Rosamond1 1 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:05:44 Complexity classes NP-complete problems Mathematical optimization Structural complexity theory Parameterized complexity P versus NP problem NP-complete NP-hard NP Theoretical computer science Computational complexity theory Applied mathematics
649	ICS 161 — Algorithms — Winter 1998 — Final Exam Name: ID: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1998-11-13 18:59:50 NP-complete problems Mathematical optimization Analysis of algorithms Time complexity NP-complete Spreadsheet Approximation algorithm Algorithm Directed acyclic graph Theoretical computer science Applied mathematics Computational complexity theory
650	Generalized Label Reduction for Merge-and-Shrink Heuristics Silvan Sievers and Martin Wehrle and Malte Helmert Universit¨at Basel Basel, Switzerland {silvan.sievers,martin.wehrle,malte.helmert}@unibas.ch Add to Reading List Source URL: ai.cs.unibas.ch Language: English - Date: 2014-05-12 05:45:15 Lambda calculus Logic in computer science L-reduction Combinatory logic Reduction Friedrich Robert Helmert Theoretical computer science Computational complexity theory Applied mathematics

UPDATE